Mixture Hyperplanes Approximation for Global Tracking
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Minimizing Empirical Error by Axis-Parallel Hyperplanes
Many learning situations involve separation of labeled training instances by hyperplanes. Consistent separation is of theoretical interest, but the real goal is rather to minimize the number of errors using a bounded number of hyperplanes. Exact minimization of empirical error in a high-dimensional grid induced into the feature space by axis-parallel hyperplanes is NP-hard. We develop two appro...
متن کاملHinging hyperplanes for regression, classification, and function approximation
A hinge function y = h (x) consists of two hyperplanes continuously joined together at a hinge. In regression (prediction), classification (pattern recognition), and noiseless function approximation, use of sums of hinge functions gives a powerful and efficient altemative to neural networks with compute times several orders of magnitude less than fitting neural networks with a comparable number...
متن کاملMixture-Rank Matrix Approximation for Collaborative Filtering
Low-rank matrix approximation (LRMA) methods have achieved excellent accuracy among today’s collaborative filtering (CF) methods. In existing LRMA methods, the rank of user/item feature matrices is typically fixed, i.e., the same rank is adopted to describe all users/items. However, our studies show that submatrices with different ranks could coexist in the same user-item rating matrix, so that...
متن کاملGaussian Mixture Model for Multi-sensor Tracking
We present an algorithm for tracking many objects observed with distributed, non-overlapping sensors. Our method is derived from a proposition that the observations of some constant, intrinsic properties of an object form a cluster (eg. in the color space). However sensors also provide dynamic data about an object like time and location. Tracking is achieved by probabilistic clustering of obser...
متن کاملMultisensor Multitarget Mixture Reduction Algorithms for Tracking
A single-sensor single-target Mixture Reduction (MR) data association algorithm is extended for use in multisensor multitarget tracking situations. MR is extended for tracking an arbitrary number of targets using an arbitrary number of sensors under the assumption that the sensor measurement errors are independent across sensors. Like the single-sensor single-target MR algorithm, which gives be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2015
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2015edl8040